LCMFO: An Improved Moth-Flame Algorithm for Combinatorial Optimization Problems
نویسندگان
چکیده
منابع مشابه
An Improved Co-Evolution Genetic Algorithm for Combinatorial Optimization Problems
This paper presents an improved co-evolution genetic algorithm (ICGA), which uses the methodology of game theory to solve the mode deception and premature convergence problem. In ICGA, groups become different players in the game. Mutation operator is designed to simulate the situation in the evolutionary stable strategy. Information transfer mode is added to ICGA to provide greater decision-mak...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملAn Improved Firefly Algorithm for Optimization Problems
Optimization problem is one of the most difficult and challenging problems that has received considerable attention over the last decade. Researchers have been constantly investigating better ways to solve it. Recently, one optimization technique called firefly algorithm has gained the interest of many researchers. This algorithm is a type of swarm intelligence algorithm based on the reaction o...
متن کاملOptimal Reactive Power Dispatch Using Moth-Flame Optimization Algorithm
This paper describes a newly developed Moth-Flame optimization algorithm to deal with optimal reactive power dispatch problem. The prime intention of reactive power dispatch problem is to curtail the real power loss and control the bus voltages in power system network. The Moth-Flame algorithm is one of the most powerful and robust new global optimization algorithms in engineering. The primary ...
متن کاملCombinatorial Optimization Problems for Which Almostevery Algorithm
Consider a class of optimization problems for which the cardinality of the set of feasible solutions is m and the size of every feasible solution is N. We prove in a general probabilistic framework that the value of the optimal solution and the value of the worst solution are asymptotically almost surely (a.s.) the same provided log m = o(N) as N and m become large. This result implies that for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering and Technology
سال: 2018
ISSN: 0975-4024,2319-8613
DOI: 10.21817/ijet/2018/v10i6/181006091